Section: New Results

Steganography

D. Augot, M. Barbier and Caroline Fontaine randomized the bounded syndrome coding problem on wet paper—an important embedding problem in steganography—such that this problem always has a solution [24] . This randomization is inspired the Courtois–Finiasz–Sendrier signature scheme, and shows nice results for linear perfect codes. In the special case of binary Hamming codes, this new method reaches exactly the necessary and sufficient bounds to ensure the embedding. The previous bounds were introduced by Carlos Munuera and M. Barbier [19] . These bounds depend on the dual distance of the code used. Thanks to the generalized Hamming weight, they proved that codes with low MDS rank are better in this context. Since the nature of their results are combinatorial, the authors generalized a bound for systematic non linear codes and showed that the non-linear systematic codes could be good candidates, as shown by the example of the Nadler code.